Data Sharing Analysis for a Database Programming Lanaguage via Abstract Interpretation
نویسندگان
چکیده
This paper presents an experiment in nsing n fnrmnl techniqne for static prngrnm nnnlyais, hnsod an abstract intarpre t.ntion, in the context of persistent progrnmming Inngnngw. The nim of thn annlysis is to dntoct npportnnities for snfe parallelism fnr trnnsnetinn nperatinn sehadnling. Tmnsnctinn apcratinns cnn he snfely intarlanved when there is no nverlnpping among their rends& nnd writ-b. A non-atnndnrd interpreter perfnrmcl the nnnlysis. This interpreter, given the text of n trnns.actinn nnd n reprascntntinn nf the dntn stored in the dntnh.m, oufnmnfica//y derivea in n finite time n11 npprnxirnntinn of the randset and writ-t nf the nnnlysed lrnnsnclinn. lnfnrmntian ahtnined from the non-atnndnrd interpret,ntinn is provided to the schodnler hefnra haginning the cxrcntion of trnnsactinn operations. In this way, we ohtnin A schrdnler thnt renlism n cnnservntive two-phase lacking protocol fnr persistent programming Inngnaga trnnsactinncl. We npply the nnalysis to n Iangnage thnt is n signiticnnt snhset of Gnlilan. The gnnl of the nnnlyh i.s tn &.teet the nccems xnlely to shnrc\nhle nnd mnclitinhle persistent dntn.
منابع مشابه
Automatic Analysis of Pointer Aliasing for Untyped Programs
In this paper we describe an automatic analysis based on Abstract Interpretation that discovers potential sharing relationships among the data structures created by an imperative program. The analysis is able to distinguish between elements in inductively deened structures and does not require any explicit data type declaration by the programmer. In order to construct the abstract interpretatio...
متن کاملAnalysis and Optimisation of Active Database Rules Using Abstract Interpretation and Partial Evaluation
Active databases provide reactive functionality by supporting event-conditionaction rules (also known as triggers). Two key issues in active databases are analysis and optimisation of such rules. In this paper we describe how abstract interpretation and partial evaluation can be applied to these tasks, demonstrating that they provide a useful framework that both encompasses various existing dat...
متن کاملSoundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic properties for an abstract domain to be well-defined and sound with respect to the concrete semantics. In logic programming, the abstract domain Sharing is a standard choice for sharing analysis for both pract...
متن کاملConstraint Databases and Program Analysis Using Abstract Interpretation
In this paper we discuss a connection between two seemingly distant research areas in computer science: constraint databases and abstract interpretation. We show that while the goals of research in the respective communities are diierent, the used techniques are often based on similar common foundations. We substantiate this claim by showing that abstract interpretation of a standard (Algol-lik...
متن کاملComplementation of Abstract Domains made Easy
In standard abstract interpretation theory, the inverse of the reduced product of abstract domains was recently defined and called complementation. Given two domains C and D such that D abstracts C , the complement C ∼ D is the most abstract domain whose reduced product with D gives C back. We show that, when C is a continuous complete lattice, there is a particularly simple method for computin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993